Structure of trajectories of complex-matrix eigenvalues in the Hermitian-non-Hermitian transition.
نویسندگان
چکیده
The statistical properties of trajectories of eigenvalues of Gaussian complex matrices whose Hermitian condition is progressively broken are investigated. It is shown how the ordering on the real axis of the real eigenvalues is reflected in the structure of the trajectories and also in the final distribution of the eigenvalues in the complex plane.
منابع مشابه
Convergence Properties of Hermitian and Skew Hermitian Splitting Methods
In this paper we consider the solutions of linear systems of saddle point problems. By using the spectrum of a quadratic matrix polynomial, we study the eigenvalues of the iterative matrix of the Hermitian and skew Hermitian splitting method.
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملNon-Hermitian Hamiltonians with real and complex eigenvalues: An sl(2,C) approach
Potential algebras are extended from Hermitian to non-Hermitian Hamiltonians and shown to provide an elegant method for studying the transition from real to complex eigenvalues for a class of non-Hermitian Hamiltonians associated with the complex Lie algebra A1.
متن کاملHermitian metric on quantum spheres
The paper deal with non-commutative geometry. The notion of quantumspheres was introduced by podles. Here we define the quantum hermitianmetric on the quantum spaces and find it for the quantum spheres.
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 86 3 Pt 1 شماره
صفحات -
تاریخ انتشار 2012